Declarative Kernels
نویسندگان
چکیده
We introduce a declarative approach to kernel design based on background knowledge expressed in the form of logic programs. The theoretical foundation of declarative kernels is mereotopology, a general theory for studying parts and wholes and for defining topological relations among parts. Declarative kernels can be used to specify a broad class of kernels over relational data and represent a step towards bridging statistical learning and inductive logic programming. The flexibility and the effectiveness of declarative kernels is demonstrated in a number of real world problems.
منابع مشابه
kProlog: an algebraic Prolog for kernel programming
kProlog is a simple algebraic extension of Prolog with facts and rules annotated with semiring labels. We propose kProlog as a language for learning with kernels. kProlog allows to elegantly specify systems of algebraic expressions on databases. We propose some code examples of gradually increasing complexity, we give a declarative specification of some matrix operations and an algorithm to sol...
متن کاملDecomposition Kernels for Natural Language Processing
We propose a simple solution to the sequence labeling problem based on an extension of weighted decomposition kernels. We additionally introduce a multiinstance kernel approach for representing lexical word sense information. These new ideas have been preliminarily tested on named entity recognition and PP attachment disambiguation. We finally suggest how these techniques could be potentially m...
متن کاملArrayBridge: Interweaving declarative array processing with high-performance computing
Scientists are increasingly turning to datacenter-scale computers to produce and analyze massive arrays. Despite decades of database research that extols the virtues of declarative query processing, scientists still write, debug and parallelize imperative HPC kernels even for the most mundane queries. This impedance mismatch has been partly attributed to the cumbersome data loading process; in ...
متن کاملLearning with Kernels and Logical Representations
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background knowledge are used to form a kernel function, enabling us to subsequently apply a number of kernel-based statistical learning algorithms. Different representational frameworks and associated algorithms are explored i...
متن کاملA critical study of Wahhabism interpretation from verses that deal with declarative attributes
Some verses of the Holy Quran ascribe attributes to God, the Almighty. This ascription has led to similitude and embodiment. The nature of these attributes has been one of the constant concerns of Quran scholars from the beginning of the spread of the knowledge of interpretation until today. Having these concerns in mind, the commentators have interpreted these verses according to their beliefs...
متن کامل